Interactive Computation of Homology of Finite Partially Ordered Sets
نویسندگان
چکیده
We outline a method for practical use of an interactive system (APL) to compute the homology of finite partially ordered sets. 1. Prerequisites. All partially ordered sets (posets) are assumed finite. Given a poset , we say that b covers a if b > a and a g c ^ h implies a = c or b = c. Since we deal with finite posets, the order relation can be obtained as the reflexive, transitive closure of the cover relation. Our programs allow the user to describe posets by the cover relation considered as a list of ordered pairs (more precisely, as an N x 2 matrix). For its own convenience, the program only accepts cover relations which are subsets of the usual order on the natural numbers. There is no difficulty representing any poset in this fashion, e.g., the cover relation of a "labeled Hasse diagram" [1]. In order to calculate the homology of a poset, we define a functor, C: .^0-> .V/77, from the category of finite posets to the category of finite chain complexes of abelian groups. If P is a poset, then the group of n-chains, Cn(P), is the free abelian group generated by symbols a0 < a l < • • • < an in P. The boundary operator r is defined on each generator a0 < a, < < an by the formula d(a0 < • • • <an)= £ (-l)'flo < ' <«,-< <«« O&i;&n; where a0 < • • • < a t < • • • < an is the generator of Cn _,(P) obtained from a 0 < • • • < a, < • • • < an by deleting the element a,. The n-th homology group of P, Hn(P), is defined to be the nth homology group of the complex C(P). For the category of small categories, #at, which includes ^0 , homology is usually defined as the homology of the simplicial set nerve of P, N(P). It is well known [3], [6], that these homology theories are isomorphic. 2. Method. We begin by describing some of the functions in our APL-workspace: PO: PO computes the graph of the < relation in poset P and represents it as an N x N matrix called POMAT. CHAIN: CHAIN computes the list of K-1-chains in the poset P from the list of K-chains and POMAT. BD: BD computes …
منابع مشابه
Tripled partially ordered sets
In this paper, we introduce tripled partially ordered sets and monotone functions on tripled partiallyordered sets. Some basic properties on these new dened sets are studied and some examples forclarifying are given.
متن کاملInterval fractional integrodifferential equations without singular kernel by fixed point in partially ordered sets
This work is devoted to the study of global solution for initial value problem of interval fractional integrodifferential equations involving Caputo-Fabrizio fractional derivative without singular kernel admitting only the existence of a lower solution or an upper solution. Our method is based on fixed point in partially ordered sets. In this study, we guaranty the existence of special kind of ...
متن کاملFixed point theorems for $alpha$-$psi$-contractive mappings in partially ordered sets and application to ordinary differential equations
In this paper, we introduce $alpha$-$psi$-contractive mapping in partially ordered sets and construct fixed point theorems to solve a first-order ordinary differential equation by existence of its lower solution.
متن کاملCategorical properties of regular partially ordered pure monomorphisms
Let a family of monomorphisms in the category A To study mathematical notions in a category A, such as injectivity, tensor products, flatness, with respect to a class M of its (mono)morphisms, one should know some of the categorical properties of the pair (A ,M ). In this paper we take A to be thecategory Pos-S of S-partially ordered sets and to be a particular class o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Comput.
دوره 4 شماره
صفحات -
تاریخ انتشار 1975